Rates of Convergence of Some Multivariate Markov Chains with Polynomial Eigenfunctions
نویسندگان
چکیده
We provide a sharp non-asymptotic analysis of the rates of convergence for some standard multivariate Markov chains using spectral techniques. All chains under consideration have multivariate orthogonal polynomial as eigenfunctions. Our examples include the Moran’s model in population genetics and its variants in community ecology, the Dirichlet-Multinomial Gibbs sampler, a class of generalized Bernoulli-Laplace processes, a generalized Ehrenfest urn model, and the multivariate normal autoregressive process.
منابع مشابه
Rates of Convergence of Some Multivariate Markov Chains with Polynomial Eigenfunctions by Kshitij Khare
We provide a sharp nonasymptotic analysis of the rates of convergence for some standard multivariate Markov chains using spectral techniques. All chains under consideration have multivariate orthogonal polynomial as eigenfunctions. Our examples include the Moran model in population genetics and its variants in community ecology, the Dirichlet-multinomial Gibbs sampler, a class of generalized Be...
متن کاملSeveral Types of Ergodicity for M/g/1-type Markov Chains and Markov Processes
In this paper we study polynomial and geometric (exponential) ergodicity forM/G/1-type Markov chains and Markov processes. First, practical criteria for M/G/1-type Markov chains are obtained by analyzing the generating function of the first return probability to level 0. Then the corresponding criteria for M/G/1-type Markov processes are given, using their h-approximation chains. Our method yie...
متن کاملEigenfunctions for Random Walks on Hyperplane Arrangements by John Pike A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA
A large class of seemingly disparate Markov chains can be modeled as random walks on the chambers of hyperplane arrangements. Examples include models from computer science, statistical mechanics, military campaigns, and card shuffling, as well as many natural random walks on finite reflection groups. A remarkable feature of these chains is that the general theory is fairly complete. For instanc...
متن کاملThree Kinds of Geometric Convergence for Markov Chains and the Spectral Gap Property
In this paper we investigate three types of convergence for geometrically ergodic Markov chains (MCs) with countable state space, which in general lead to different ‘rates of convergence’. For reversible Markov chains it is shown that these rates coincide. For general MCs we show some connections between their rates and those of the associated reversed MCs. Moreover, we study the relations betw...
متن کاملApproximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique based on the simulation of ergodic Markov chains, it is shown that, for self-reducible structures, almost uniform generation is possible in polynomial time provided only that randomised approximate counting to within some arbitrary polynomial factor is possible in polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008